Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functional Dependencies between Variables

Itisa standard practice to de ne the truth conditionsfora rst-orderform ula with a quanti erin term sofassignm entsto individualvariables. For exam ple,letM be a m odeland s a function (assignm ent)which assignsto variableselem entsin thedom ain ofM .Then a formula 9x (x)istruein M undersi thereisan assignm entswhich di ersfrom satm ostin thevalue itassignsto x,such that (x)istrue on M unders. ...

متن کامل

ArgSemSAT-1.0: Exploiting SAT Solvers in Abstract Argumentation

In this paper we describe the system ArgSemSAT-1.0 which includes algorithms that efficiently address several decision and enumeration problems — associated to various semantics — in abstract argumentation.

متن کامل

Efficiently Exploiting Dependencies in Local Search for SAT

We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates), ii) a conjunction of equivalence clauses, and iii) the remaining clauses. We also adopt a new hierarchical cost function that focuses on solving the core components of the problem first. We then show experimentally t...

متن کامل

Improving SAT Solvers by Exploiting Empirical Characteristics of CDCL

The Boolean Satisfiability Problem (SAT) is a canonical decision problem originally shown to be NP-complete in Cook’s seminal work on the theory of computational complexity. The SAT problem is one of several computational tasks identified by researchers as core problems in computer science. The existence of an efficient decision procedure for SAT would imply P = NP. However, numerous algorithms...

متن کامل

Exploiting functional dependencies in qualitative probabilistic reasoning

Functional dependencies restrict the potential interactions among variables connected in a probabilistic network. This restriction can be exploited in qualitative probabilistic reasoning by introducing deterministic variables and mod­ ifying the inference rules to produce stronger conclusions in the presence of functional rela­ tions. I describe how to accomplish these modi­ fications in qualit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Information Processing

سال: 2017

ISSN: 1882-6652

DOI: 10.2197/ipsjjip.25.459